State evolution for approximate message passing with non-separable functions
نویسندگان
چکیده
منابع مشابه
State Evolution for Approximate Message Passing with Non-Separable Functions
Given a high-dimensional data matrix A ∈ Rm×n, Approximate Message Passing (AMP) algorithms construct sequences of vectors u ∈ R, v ∈ R, indexed by t ∈ {0, 1, 2 . . . } by iteratively applying A or AT, and suitable non-linear functions, which depend on the specific application. Special instances of this approach have been developed –among other applications– for compressed sensing reconstructio...
متن کاملApproximate Message Passing with A Class of Non-Separable Denoisers
Approximate message passing (AMP) is a class of low-complexity scalable algorithms for solving high-dimensional linear regression tasks where one wishes to recover an unknown signal β0 from noisy, linear measurements y = Aβ0 + w. AMP has the attractive feature that its performance (for example, the mean squared error of its estimates) can be accurately tracked by a simple, scalar iteration refe...
متن کاملState Evolution for General Approximate Message Passing Algorithms, with Applications to Spatial Coupling
We consider a class of approximated message passing (AMP) algorithms and characterize their high-dimensional behavior in terms of a suitable state evolution recursion. Our proof applies to Gaussian matrices with independent but not necessarily identically distributed entries. It covers – in particular– the analysis of generalized AMP, introduced by Rangan, and of AMP reconstruction in compresse...
متن کاملApproximate Message Passing
In this note, I summarize Sections 5.1 and 5.2 of Arian Maleki’s PhD thesis. 1 Notation We denote scalars by small letters e.g. a, b, c, . . ., vectors by boldface small letters e.g. λ,α,x, . . ., matrices by boldface capital letter e.g. A,B,C, . . ., (subsets of) natural numbers by capital letters e.g. N,M, . . .. We denote i’th element of a vector a by ai and (i, j)’th entry of a matrix A by ...
متن کاملApproximate Message Passing with Universal Denoising
We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics are unknown; the goal is to provide reconstruction algorithms that are universal to the input statistics. We present a novel algorithmic framework that combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Inference: A Journal of the IMA
سال: 2019
ISSN: 2049-8764,2049-8772
DOI: 10.1093/imaiai/iay021